Dihedral sieving on cluster complexes

نویسندگان

چکیده

The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers group actions on finite sets using q-analogue polynomials. Eu Fu demonstrated a generalized cluster complexes every type q-Catalan numbers. In this paper, we exhibit dihedral phenomenon, introduced for odd n by Rao Suk, clusters type. A case, show that Raney numbers count both reflection-symmetric k-angulations an n-gon particular evaluation (q,t)-Fuss--Catalan We also introduce symmetric group, discuss possibilities even n.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dihedral Sieving Phenomena

Abstract. Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially qanalogues, have useful interpretations related to actions and representations of the cyclic group. We define sieving for an arbitrary group G and study it for the dihedral group I2pnq of order 2n. This requires understanding the generators of the representation ring of the dihedral group. For ...

متن کامل

The Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes

The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge’s q = −1 phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in typ...

متن کامل

Cyclic Sieving and Cluster Multicomplexes

Reiner, Stanton, and White [10] proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu [2] generalized these results to Cartan-Killing types other than A by means of actions of deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky [6]. The ReinerStanton-White and Eu-Fu results were proven using direct counting arguments. We give rep...

متن کامل

Improved Sieving on Algebraic Curves

The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...

متن کامل

Multi - cluster complexes

We present a family of simplicial complexes called multi-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types A and B to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Enumerative combinatorics and applications

سال: 2021

ISSN: ['2710-2335']

DOI: https://doi.org/10.54550/eca2022v2s2r9